Currying of Order-Sorted Term Rewriting Systems
نویسندگان
چکیده
Term rewriting system is a helpful tool for implementing functional programming languages. We focus upon a transformation of term rewriting systems called currying. Currying transforms a term rewriting system with symbols of arbitrary arity into another one, which contains only nullary symbols with a single binary symbol called application. Currying in single-sorted case is explored in [1] but currying in typed case remains as a problem. This paper rst proposes currying of order-sorted term rewriting systems. Then, we prove that compatibility and con uence of order-sorted term rewriting systems are preserved by currying.
منابع مشابه
KAWABE and ISHII : THE COMPLETENESS OF ORDER - SORTED TERM REWRITING SYSTEMS IS PRESERVED
The currying of term rewriting systems (TRSs) is a transformation of TRSs from a functional form to an applicative form. We have already introduced an order-sorted version of currying and proved that the compatibility and con uence of order-sorted TRSs were preserved by currying[3]. In this paper, we focus on a key property of TRSs, completeness. We rst show some proofs omitted in ref.[3]. Then...
متن کاملTransforming Termination by Self-Labelling
We introduce a new technique for proving termination of term rewriting systems. The technique, a specialization of Zantema’s semantic labelling technique, is especially useful for establishing the correctness of transformation methods that attempt to prove termination by transforming term rewriting systems into systems whose termination is easier to prove. We apply the technique to modularity, ...
متن کاملOn Modularity of the Completeness in Order-Sorted Term Rewriting Systems
In this paper, we extend the results on the modularity of con uence and termination of single-sorted TRSs[3][6][7] to order-sorted ones. Order-sorted TRSs build a good framework for handling overloaded functions and subtypes. For proving modularity of completeness of ordersorted TRSs, we rst transform a TRS with overloaded functions to a non-overloaded one, and then we demonstrate that our tran...
متن کاملComparing Curried and Uncurried Rewriting
Currying is a transformation of term rewrite systems which may contain symbols of arbitrary arity into systems which contain only nullary symbols, together with a single binary symbol called application. We show that for all term rewrite systems (whether orthogonal or not) the following properties are preserved by this transformation: strong normalization, weak normalization, weak Church-Rosser...
متن کاملSolution to the Problem of Zantema on a Persistent Property of Term Rewriting
A property P of term rewriting systems is persistent if for any many-sorted term rewriting system R, R has the property P if and only if its underlying term rewriting system Θ(R), which results from R by omitting its sort information, has the property P . It is shown that termination is a persistent property of many-sorted term rewriting systems that contain only variables of the same sort.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995